منابع مشابه
Inference Rules in Nelson's Logics, Admissibility and Weak Admissibility
Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....
متن کاملAdmissibility and Event-rationality Admissibility and Event-rationality
We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their conjectures. A player is event-rational if she best responds to a conjecture and uses a list of subs...
متن کاملWeak admissibility does not imply admissibility for analytic semigroups
Two conjectures on admissible control operators by George Weiss are disproved in this paper. One conjecture says that an operator B defined on an infinite-dimensional Hilbert space U is an admissible control operator if for every element u ∈ U the vector Bu defines an admissible control operator. The other conjecture says that B is an admissible control operator if a certain resolvent estimate ...
متن کاملOn the Lie-Santilli Admissibility
The largest class of hyperstructures is the one which satisfies the weak properties. We connect the theory of P-hopes, a large class of hyperoperations, with the Lie-Santilli admissibility used in Hardonic Mechanics. This can be achieved by a kind of Ree, sandwich hyperoperation.
متن کاملStrong Admissibility Revisited
In the current paper, we re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its extension-based and in its labelling-based form. Moreover, we show that strong admissibility plays a vital role in discussionbased proof procedures for grounded semantics. In particular it allows one t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1996
ISSN: 0021-8693
DOI: 10.1006/jabr.1996.0330